#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=3e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
map<LL,LL>map1;
LL a[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL n,p,k;cin>>n>>p>>k;
   for(LL i=1;i<=n;i++){
       cin>>a[i];
       map1[a[i]]++;
   }
   LL cnt=k%p;
   LL ans=0;
   for(LL i=1;i<=n;i++){
       map1[a[i]]--;
       ///map<LL,LL>::iterator it=map1.lower_bound(x);
       ///LL num=lower_bound()
       LL num=cnt-a[i]*a[i]*a[i];
       if(num<0) continue;
       for(LL j=0;j*j*j<=num;j++){
           if(a[i]*a[i]*j+a[i]*j*j+j*j*j==num){
              if(num%p==k) ans++;
           }
       }
   }
   cout<<ans<<"\n";
   return 0;
}
